Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching
نویسندگان
چکیده
We give a simple proof that the RANKING algorithm of Karp, Vazirani and Vazirani [KVV90] is 1-1/e competitive for the online bipartite matching problem. The proof is via a randomized primal-dual argument. Primal-dual algorithms have been successfully used for many online algorithm problems, but the dual constraints are always satisfied deterministically. This is the first instance of a non-trivial randomized primal-dual algorithm in which the dual constraints only hold in expectation. The approach also generalizes easily to the vertex-weighted version considered by Agarwal et al. [AGKM11]. Further we show that the proof is very similar to the deterministic primal-dual argument for the online budgeted allocation problem with small bids (also called the AdWords problem) of Mehta et al. [MSVV05].
منابع مشابه
Maximum Matching in the Online Batch-Arrival Model
Consider a two-stage matching problem, where edges of an input graph are revealed in two stages (batches) and in each stage we have to immediately and irrevocably extend our matching using the edges from that stage. The natural greedy algorithm is half competitive. Even though there is a huge literature on online matching in adversarial vertex arrival model, no positive results were previously ...
متن کاملOnline Vertex Cover and Matching: Beating the Greedy Algorithm
In this paper, we explicitly study the online vertex cover problem, which is a natural generalization of the well-studied ski-rental problem. In the online vertex cover problem, we are required to maintain a monotone vertex cover in a graph whose vertices arrive online. When a vertex arrives, all its incident edges to previously arrived vertices are revealed to the algorithm. For bipartite grap...
متن کاملHow to Match when All Vertices Arrive Online
We introduce a fully online model of maximum cardinality matching in which all vertices arrive online. On the arrival of a vertex, its incident edges to previously-arrived vertices are revealed. Each vertex has a deadline that is after all its neighbors’ arrivals. If a vertex remains unmatched until its deadline, the algorithm must then irrevocably either match it to an unmatched neighbor, or l...
متن کاملBeating Ratio 0.5 for Weighted Oblivious Matching Problems
We prove the first non-trivial performance ratios strictly above 0.5 for weighted versions of the oblivious matching problem. Even for the unweighted version, since Aronson, Dyer, Frieze, and Suen first proved a non-trivial ratio above 0.5 in the mid-1990s, during the next twenty years several attempts have been made to improve this ratio, until Chan, Chen, Wu and Zhao successfully achieved a s...
متن کاملCse525: Randomized Algorithms and Probabilistic Analysis Lecture 8 1.1 Ranking Algorithm
1 Online bipartite matching Recall from last time we introduced the online bipartite matching problem and gave an algorithm to solve a fractional version of the problem with competitive ratio 1− 1/e. In the online bipartite matching problem, we are given a bipartite graph G = (L,R,E), where the vertices in R are revealed to us one at a time along with the edges from that vertex to L. Once each ...
متن کامل